Dijkstra monads forever: termination-sensitive specifications for interaction trees
نویسندگان
چکیده
منابع مشابه
Dijkstra Monads in Monadic Computation
The Dijkstra monad has been introduced recently for capturing weakest precondition computations within the context of program verification, supported by a theorem prover. Here we give a more general description of such Dijkstra monads in a categorical setting. We first elaborate the recently developed view on program semantics in terms of a triangle of computations, state transformers, and pred...
متن کاملDijkstra and Hoare monads in monadic computation
The Dijkstra and Hoare monads have been introduced recently for capturing weakest precondition computations and computations with preand post-conditions, within the context of program verification, supported by a theorem prover. Here we give a more general description of such monads in a categorical setting. We first elaborate the recently developed view on program semantics in terms of a trian...
متن کاملTrees, ordinals mad termination*
Trees are a natural representation for countable ordinals. In particular, finite trees provide a convenient notation the predicative ones. Processes that transform trees or terms can often be proved terminating by viewing the tree or the tree representation of the term as an ordinal.
متن کاملTrees, Ordinals and Termination
Trees are a natural representation for countable ordinals. In particular, nite trees provide a convenient notation for the predicative ones. Processes that transform trees or terms can often be proved terminating by viewing the tree or the tree representation of the term as an ordinal.
متن کاملTermination of context-sensitive rewriting
Context-sensitive term rewriting is a kind of term rewriting in which reduction is not allowed inside some xed arguments of some function symbols. We introduce two new techniques for proving termination of context-sensitive rewriting. The rst one is a modi cation of the technique of interpretation in a well-founded order, the second one is implied by a transformation in which context-sensitive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2021
ISSN: 2475-1421
DOI: 10.1145/3434307